package DynamicProgramming;

/**
 * @ClassName LC1337
 * @Description  第 N 个泰波那契数
 * @Author ZJX
 * @Date 2024/9/16 20:27
 * @Version 1.0
 */
public class LC1337 {
    public int tribonacci(int n) {
        if (n == 0) return 0;
        if (n == 1 || n == 2) return 1;

        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        dp[2] = 1;

        for (int i = 3; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2] + dp[i - 3];
        }

        return dp[n];
    }
}
